On integrable conservation laws
نویسندگان
چکیده
منابع مشابه
On integrable conservation laws.
We study normal forms of scalar integrable dispersive (not necessarily Hamiltonian) conservation laws, via the Dubrovin-Zhang perturbative scheme. Our computations support the conjecture that such normal forms are parametrized by infinitely many arbitrary functions that can be identified with the coefficients of the quasi-linear part of the equation. Moreover, in general, we conjecture that two...
متن کاملScalar Non-linear Conservation Laws with Integrable Boundary Data
We consider the initial-boundary value problem for a scalar non-linear conservation law u t + f(u)] x = 0; u(0; x) = u(x); u(; 0) = ~ u(t); () on the domain = f(t; x) 2 R 2 : t 0; x 0g. Here u = u(t; x) is the state variable, u; ~ u are integrable (possibly unbounded) initial and boundary data, and f is assumed to be strictly convex and superlinear. We rst derive an explicit formula for a solut...
متن کاملConservation laws and bosonization in integrable Luttinger liquids.
We examine and explain the Luttinger-liquid character of models solvable by the Bethe ansatz by introducing a suitable bosonic operator algebra. In the case of the Hubbard chain, this involves two bosonic algebras which apply to all values of U , electronic density, and magnetization. Only at zero magnetization does this lead to the usual charge spin separation. We show that our “pseudoparticle...
متن کاملOn conservation laws in elastodynamics
The objective of this investigation is the establishment of governing balance and conservation laws in elastodynamics. The feature of the approach employed here consists in placing time on the same level as the space coordinates, as is done in the theory of relativity, i.e., pursuing a 4 · 4 formalism. Both the Lagrangian and the Eulerian descriptions of the postulated Lagrangian function are f...
متن کاملConservation laws ,
We show that if performance measures in stochastic and dynamic scheduling problems satisfy generalized conservation laws, then the feasible space of achievable performance is a polyhedron called an extended polymatroid that generalizes the usual polymatroids introduced by Edmonds. Optimization of a linear objective over an extended polymatroid is solved by an adaptive greedy algorithm, which le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2015
ISSN: 1364-5021,1471-2946
DOI: 10.1098/rspa.2014.0124